YES 0.707
H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:
↳ HASKELL
↳ LR
mainModule Main
| ((length :: [a] -> Int) :: [a] -> Int) |
module Main where
Lambda Reductions:
The following Lambda expression
\n_→n + 1
is transformed to
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
mainModule Main
| ((length :: [a] -> Int) :: [a] -> Int) |
module Main where
Replaced joker patterns by fresh variables and removed binding patterns.
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
mainModule Main
| ((length :: [a] -> Int) :: [a] -> Int) |
module Main where
Cond Reductions:
The following Function with conditions
is transformed to
undefined0 | True | = undefined |
undefined1 | | = undefined0 False |
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
mainModule Main
| ((length :: [a] -> Int) :: [a] -> Int) |
module Main where
Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
mainModule Main
module Main where
Haskell To QDPs
↳ HASKELL
↳ LR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ QDP
↳ QDPSizeChangeProof
Q DP problem:
The TRS P consists of the following rules:
new_enforceWHNF(vy5, vy310, vy4, :(vy3110, vy3111), ba) → new_enforceWHNF(new_primPlusNat(vy5), vy3110, new_primPlusNat(vy5), vy3111, ba)
The TRS R consists of the following rules:
new_primPlusNat(Zero) → Succ(Zero)
new_primPlusNat0(Succ(vy500)) → Succ(vy500)
new_primPlusNat(Succ(vy50)) → Succ(Succ(new_primPlusNat0(vy50)))
new_primPlusNat0(Zero) → Zero
The set Q consists of the following terms:
new_primPlusNat0(Succ(x0))
new_primPlusNat(Zero)
new_primPlusNat0(Zero)
new_primPlusNat(Succ(x0))
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_enforceWHNF(vy5, vy310, vy4, :(vy3110, vy3111), ba) → new_enforceWHNF(new_primPlusNat(vy5), vy3110, new_primPlusNat(vy5), vy3111, ba)
The graph contains the following edges 4 > 2, 4 > 4, 5 >= 5